Formalization of Universal Algebra in Agda

Universal Algebra

Subdirect Unions in Universal Algebra

The number of distinct operations (that is, the range of the variable a) may be infinite, but for our main result (Theorem 2), we shall require every n(a) to be finite—that is, it will concern algebras with finitary operations. The concepts of subalgebra, congruence relation on an algebra, homomorphism of one algebra A onto (or into) another algebra with the same operations, and of the direct u...

A Formalization of Unique Solutions of Equations in Process Algebra

In this thesis, a comprehensive formalization of Milner’s Calculus of Communicating Systems (also known as CCS) has been done in HOL theorem prover (HOL4), based on an old work in HOL88. This includes all classical properties of strong/weak bisimulation equivalences and observation congruence, a theory of congruence for CCS, various versions of “bisimulation up to” techniques, and several deep ...

Universal Algebra in Type Theory

We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. We use setoids, i.e. types endowed with an arbitrary equivalence relation, as carriers for algebras. In this way it is possible to define the quotient of an algebra by a congruence. Standard constructions over algebra...

Universal Dialgebra: Unifying Universal Algebra and Coalgebra

The concept of dialgebra provides a platform under which universal algebra and coalgebra are unified in one theory. Other examples of dialgebras include universal multialgebras and partial algebras. In the dialgebraic setting, several relationships between common features of these various theories are clarified and, in many cases, rather similar proofs of closely related results are combined to...